Competition between discrete random variables, with applications to occupancy problems
نویسندگان
چکیده
Consider n players whose ‘‘scores’’ are independent and identically distributed values fXigi 1⁄4 1 from some discrete distribution F. We pay special attention to the cases where (i) F is geometric with parameter p-0 and (ii) F is uniform on f1;2; . . . ;Ng; the latter case clearly corresponds to the classical occupancy problem. The quantities of interest to us are, first, the U-statistic W which counts the number of ‘‘ties’’ between pairs i, j; second, the univariate statistic Yr, which counts the number of strict r-way ties between contestants, i.e., episodes of the form Xi1 1⁄4 Xi2 1⁄4 1⁄4 Xir ; XjaXi1 ; jai1; i2; . . . ; ir; and, last but not least, the multivariate vector ZAB=(YA, YA+1,y,YB). We provide Poisson approximations for the distributions of W, Yr and ZAB under some general conditions. New results on the joint distribution of cell counts in the occupancy problem are derived as a corollary. & 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Testing Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملMoment Convergence in Conditional Limit Theorems
SVANTE JANSON Abstract. Consider a sum ∑N 1 Yi of random variables conditioned on a given value of the sum ∑N 1 Xi of some other variables, where Xi and Yi are dependent but the pairs (Xi, Yi) form an i.i.d. sequence. We consider here the case when each Xi is discrete. We prove, for a triangular array ((Xni, Yni)) of such pairs satisfying certain conditions, both convergence of the distribution...
متن کاملOptimum Structural Design with Discrete Variables Using League Championship Algorithm
In this paper a league championship algorithm (LCA) is developed for structural optimization where the optimization variables are of discrete type and the set of the values possibly obtained by each variable is also given. LCA is a relatively new metaheuristic algorithm inspired from sport championship process. In LCA, each individual can choose to approach to or retreat from other individuals ...
متن کاملConditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کامل